Scalable, parallel computers: Alternatives, issues, and challenges

Scalable Load Balancing Techniques for Parallel Computers

In this paper we analyze the scalability of a number of load balancing algorithms which can be applied to problems that have the following characteristics : the work done by a processor can be partitioned into independent work pieces; the work pieces are of highly variable sizes; and it is not possible (or very diicult) to estimate the size of total work at a given processor. Such problems requ...

Scalable Parallel Matrix Multiplication on Distributed Memory Parallel Computers

Consider any known sequential algorithm for matrix multiplication over an arbitrary ring with time complexity O(N ), where 2 < 3. We show that such an algorithm can be parallelized on a distributed memory parallel computer (DMPC) in O(logN) time by using N = logN processors. Such a parallel computation is cost optimal and matches the performance of PRAM. Furthermore, our parallelization on a DM...

Sandwich Generation Issues and Challenges

Today, with the increase in the elderly population and life expectancy, the need to use care services for this significant part of the population is increasing. Beliefs, cultures, and social norms among different ethnicities and races are vital in the extent and nature of care. Two types of care exist, informal and formal. According to statistics by the Secretariat of the National Council on Ag...

Alternatives through Computers

A Scalable Parallel Graph Coloring Algorithm for Distributed Memory Computers

In large-scale parallel applications a graph coloring is often carried out to schedule computational tasks. In this paper, we describe a new distributedmemory algorithm for doing the coloring itself in parallel. The algorithm operates in an iterative fashion; in each round vertices are speculatively colored based on limited information, and then a set of incorrectly colored vertices, to be reco...